Approximation and Optimization of L1-norm for Continuous-Time Linear Systems

نویسندگان

  • Xiajiao Wang
  • Jun Wu
  • Weihua Xu
  • Sheng Chen
  • Xiaoliang Wang
چکیده

for Continuous-Time Linear Systems Xiajiao Wang, Jun Wu, Weihua Xu, Sheng Chen, Xiaoliang Wang National Laboratory of Industrial Control Technology, Institute of Advanced Process Control, Zhejiang University, Hangzhou 310027 (E-mail: [email protected]) Department of Electronics and Computer Science,University of Southampton, Southampton, SO17 1BJ,UK 3) Department of Electronics, College of Information Science and Technology, Jinan University, Guangzhou 510630 Abstract—A method is derived to approximate the L1-norm of continuous-time linear time-invariant systems. The optimization problem is then formulated to design fixed-order L1-controller. The method of approach and Simulated Annealing Algorithm are utilized to solve the problem. Numerical examples illustrate the design procedure.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A linear complementarity based characterization of the weighted independence number and the independent domination number in graphs

The linear complementarity problem is a continuous optimization problem that generalizes convex quadratic programming, Nash equilibria of bimatrix games and several such problems. This paper presents a continuous optimization formulation for the weighted independence number of a graph by characterizing it as the maximum weighted l1 norm over the solution set of a linear complementarity problem ...

متن کامل

An L1-norm method for generating all of efficient solutions of multi-objective integer linear programming problem

This paper extends the proposed method by Jahanshahloo et al. (2004) (a method for generating all the efficient solutions of a 0–1 multi-objective linear programming problem, Asia-Pacific Journal of Operational Research). This paper considers the recession direction for a multi-objective integer linear programming (MOILP) problem and presents necessary and sufficient conditions to have unbounde...

متن کامل

On the Approximation of Pseudo Linear Systems by Linear Time Varying Systems (RESEARCH NOTE)

This paper presents a modified method for approximating nonlinear systems by a sequence of linear time varying systems. The convergence proof is outlined and the potential of this methodology is discussed. Simulation results are used to show the effectiveness of the proposed method.

متن کامل

Homotopic l0 minimization technique applied to dynamic cardiac MR imaging

Introduction: The l1 minimization technique has been empirically demonstrated to exactly recover an S-sparse signal with about 3S-5S measurements [1]. In order to get exact reconstruction with smaller number of measurements, recently, for static images, Trzasko [2] has proposed homotopic l0 minimization technique. Instead of minimizing the l0 norm which achieves best possible theoretical bound ...

متن کامل

Continuous Discrete Variable Optimization of Structures Using Approximation Methods

Optimum design of structures is achieved while the design variables are continuous and discrete. To reduce the computational work involved in the optimization process, all the functions that are expensive to evaluate, are approximated. To approximate these functions, a semi quadratic function is employed. Only the diagonal terms of the Hessian matrix are used and these elements are estimated fr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006